Combinatorial polarization, code loops, and codes of high level
نویسنده
چکیده
We first find the combinatorial degree of any map f : V → F where F is a finite field and V is a finite-dimensional vector space over F . We then simplify and generalize a certain construction due to Chein and Goodaire that was used in characterizing code loops as finite Moufang loops that posses at most two squares. The construction yields binary codes of high divisibility level with prescribed Hamming weights of intersections of codewords.
منابع مشابه
Code Loops in Both Parities
We present equivalent definitions of code loops in any characteristic p 6= 0. The most natural definition is via combinatorial polarization, but we also show how to realize code loops by linear codes and as a class of symplectic conjugacy closed loops. For p odd, it is possible to define code loops via characteristic trilinear forms. Related concepts are discussed.
متن کاملDerived Forms and Binary Linear Codes
Derived forms defined by M. Aschbacher in [1] are closely related to combinatorial polarization introduced by H. N. Ward in [6]. A binary linear code is said to be of (divisibility) level r, if r is the biggest integer such that 2r divides the weight of each codeword. In this paper, we study the relation between functions of combinatorial degreee r+1 and binary linear codes of level r. We assoc...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملOptimal Three-Dimensional Optical Orthogonal Codes and Related Combinatorial Designs
Using channel polarization technique in optical code-division multiple access, we can spread optical pulses in the spatial domain, in addition to the time and frequency domains. The pattern of transmitting optical pulses in these three dimensions are specified by the codewords of a three-dimensional optical orthogonal codes (3-D OOC). In this work, combinatorial designs related to optimal 3-D O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2004 شماره
صفحات -
تاریخ انتشار 2004